optimal search algorithm

См. также в других словарях:

• Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… …   Wikipedia

• A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… …   Wikipedia

• D* search algorithm — In computer science and robotics, the D* algorithm (pronounced D star ) is a dynamic version of the backward variant of Dijkstra s algorithm and A* search algorithm. Also known as Stentz s Algorithm, it was first developed by Anthony Stentz in… …   Wikipedia

• Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

• Optimal stopping — In mathematics, the theory of optimal stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of… …   Wikipedia

• optimal — adjective /ˈɒptɪməl,ˈɑptɪməl/ a) The best, most favourable or desirable, especially under some restriction Finding the optimal balance between features and price is a common problem. b) Describing a search algor …   Wiktionary

• Optimal solutions for Rubik's Cube — Computer Graphics of a scrambled Rubik s cube There are many algorithms to solve scrambled Rubik s Cubes. The maximum number of face turns needed to solve any instance of the Rubik s cube is 20.[1] This number is also known as the diameter of the …   Wikipedia

• Index (search engine) — Search engine indexing collects, parses, and stores data to facilitate fast and accurate information retrieval. Index design incorporates interdisciplinary concepts from linguistics, cognitive psychology, mathematics, informatics, physics, and… …   Wikipedia

• Optimal substructure — Figure 1. Finding the shortest path using optimal substructure. Numbers represent the length of the path; straight lines indicate single edges, wavy lines indicate shortest paths, i.e., there might be other vertices that are not shown here. In… …   Wikipedia

• Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance …   Wikipedia

• Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… …   Wikipedia